On weak constant domain principle in the Kripke sheaf semantics Dmitrij Skvortsov? All-Russian Institute of Scientific and Technical Information, VINITI,

Source URL: logica.dmi.unisa.it

• Logic
• Mathematical logic
• Abstraction
• Predicate logic
• Model theory
• Philosophical logic
• Modal logic
• Kripke semantics
• First-order logic
• Sheaf
• FO
• Well-formed formula

Knowing Minimum/Maximum n Formulae 1 and Natasha Alechina 2 ˚ Thomas Agotnes Abstract. We introduce a logical language with nullary operators min(n), for each non-negative integer n, which mean ‘the reasoner has at l

Source URL: folk.uib.no

• Logic
• Mathematical logic
• Abstraction
• Model theory
• Formal languages
• Logical truth
• Metalogic
• First-order logic
• Interpretation
• Substitution
• Well-formed formula
• Satisfiability

Paul Oppenheimer and Edward N. Zalta Relations Versus Functions at the Foundations of Logic: Type-Theoretic Considerations∗ Paul E. Oppenheimer

Source URL: www.peoppenheimer.org

• Logic
• Mathematical logic
• Mathematics
• Model theory
• Formal languages
• Predicate logic
• Metalogic
• First-order logic
• Principia Mathematica
• Interpretation
• Well-formed formula
• Lambda calculus

Introducing Propositional Logic and Queueing Theory with the InfoTraffic Interactive Learning Environments Ruedi Arnold Institute for Pervasive Computing ETH Zurich 8092 Zurich, Switzerland

Source URL: www.ruedi-arnold.com

• Logic
• Mathematics
• Mathematical logic
• Abstraction
• Syntax
• Propositional calculus
• False
• Proposition
• Queueing theory
• Well-formed formula

1. Introduction: ***DRAFT*** @K.J.Smith, 2008. http://www.KJSmith.net 1.1 Propositional and predicate logic: [adapted from 5, 6, 8, 11, 12, 14] A propositional (zeroth-order) formula is a well-formed combination of atom

Source URL: project.kjsmith.net

Microsoft PowerPoint - Dissvortrag-Version_2007-11-08_online.ppt

Source URL: www.ruedi-arnold.com

• Logic
• Mathematical logic
• Abstraction
• Syntax
• Propositional calculus
• Non-classical logic
• Boolean algebra
• Matrix
• Well-formed formula
• Proposition
• Tautology
• First-order logic

Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies Santiago Figueira Daniel Gor´ın

Source URL: www.glyc.dc.uba.ar

• Model theory
• Logical syntax
• Philosophical logic
• Interpretation
• Entailment
• First-order logic
• Prenex normal form
• Well-formed formula
• Logical connective
• Logic
• Metalogic
• Formal languages

A Temporal Logic for Hyperproperties Bernd Finkbeiner1 , Markus N. Rabe1 , and César Sánchez2,

Source URL: software.imdea.org

• Mathematics
• Linear temporal logic
• CTL*
• Interpretation
• Computation tree logic
• Kripke structure
• Well-formed formula
• Quantification
• Model theory
• Logic
• Mathematical logic
• Temporal logic

Introduction 0-1 Law for Bernays-Sch¨ onfinkel Negative Results

Source URL: www.cs.technion.ac.il

• Mathematics
• Metalogic
• Formal languages
• First-order logic
• Predicate logic
• Boolean satisfiability problem
• Well-formed formula
• Satisfiability
• Second-order logic
• Logic
• Mathematical logic
• Model theory

Published in Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004, pages 236–250. By Reason and Authority: A System for Authorization of Proof-Carrying Code Nathan Whitehead Department of Computer

Source URL: www.cs.berkeley.edu

• Model theory
• Formal methods
• Propositional calculus
• Predicate logic
• Function
• Lambda calculus
• Forcing
• Well-formed formula
• Atomic formula
• Logic
• Mathematical logic
• Mathematics